26,876 research outputs found

    A Feature Selection Method for Multivariate Performance Measures

    Full text link
    Feature selection with specific multivariate performance measures is the key to the success of many applications, such as image retrieval and text classification. The existing feature selection methods are usually designed for classification error. In this paper, we propose a generalized sparse regularizer. Based on the proposed regularizer, we present a unified feature selection framework for general loss functions. In particular, we study the novel feature selection paradigm by optimizing multivariate performance measures. The resultant formulation is a challenging problem for high-dimensional data. Hence, a two-layer cutting plane algorithm is proposed to solve this problem, and the convergence is presented. In addition, we adapt the proposed method to optimize multivariate measures for multiple instance learning problems. The analyses by comparing with the state-of-the-art feature selection methods show that the proposed method is superior to others. Extensive experiments on large-scale and high-dimensional real world datasets show that the proposed method outperforms l1l_1-SVM and SVM-RFE when choosing a small subset of features, and achieves significantly improved performances over SVMperf^{perf} in terms of F1F_1-score

    Efficient Multi-Template Learning for Structured Prediction

    Full text link
    Conditional random field (CRF) and Structural Support Vector Machine (Structural SVM) are two state-of-the-art methods for structured prediction which captures the interdependencies among output variables. The success of these methods is attributed to the fact that their discriminative models are able to account for overlapping features on the whole input observations. These features are usually generated by applying a given set of templates on labeled data, but improper templates may lead to degraded performance. To alleviate this issue, in this paper, we propose a novel multiple template learning paradigm to learn structured prediction and the importance of each template simultaneously, so that hundreds of arbitrary templates could be added into the learning model without caution. This paradigm can be formulated as a special multiple kernel learning problem with exponential number of constraints. Then we introduce an efficient cutting plane algorithm to solve this problem in the primal, and its convergence is presented. We also evaluate the proposed learning paradigm on two widely-studied structured prediction tasks, \emph{i.e.} sequence labeling and dependency parsing. Extensive experimental results show that the proposed method outperforms CRFs and Structural SVMs due to exploiting the importance of each template. Our complexity analysis and empirical results also show that our proposed method is more efficient than OnlineMKL on very sparse and high-dimensional data. We further extend this paradigm for structured prediction using generalized pp-block norm regularization with p>1p>1, and experiments show competitive performances when p∈[1,2)p \in [1,2)

    Two monotonic functions involving gamma function and volume of unit ball

    Full text link
    In present paper, we prove the monotonicity of two functions involving the gamma function Γ(x)\Gamma(x) and relating to the nn-dimensional volume of the unit ball Bn\mathbb{B}^n in Rn\mathbb{R}^n.Comment: 7 page

    On the Application of Gluon to Heavy Quarkonium Fragmentation Functions

    Get PDF
    We analyze the uncertainties induced by different definitions of the momentum fraction zz in the application of gluon to heavy quarkonium fragmentation function. We numerically calculate the initial g→J/ψg \to J / \psi fragmentation functions by using the non-covariant definitions of zz with finite gluon momentum and find that these fragmentation functions have strong dependence on the gluon momentum k⃗\vec{k}. As ∣k⃗∣→∞| \vec{k} | \to \infty, these fragmentation functions approach to the fragmentation function in the light-cone definition. Our numerical results show that large uncertainties remains while the non-covariant definitions of zz are employed in the application of the fragmentation functions. We present for the first time the polarized gluon to J/ψJ/\psi fragmentation functions, which are fitted by the scheme exploited in this work.Comment: 11 pages, 7 figures;added reference for sec.

    General Relationship Between the Entanglement Spectrum and the Edge State Spectrum of Topological Quantum States

    Full text link
    We consider (2+1)-dimensional topological quantum states which possess edge states described by a chiral (1+1)-dimensional Conformal Field Theory (CFT), such as e.g. a general quantum Hall state. We demonstrate that for such states the reduced density matrix of a finite spatial region of the gapped topological state is a thermal density matrix of the chiral edge state CFT which would appear at the spatial boundary of that region. We obtain this result by applying a physical instantaneous cut to the gapped system, and by viewing the cutting process as a sudden "quantum quench" into a CFT, using the tools of boundary conformal field theory. We thus provide a demonstration of the observation made by Li and Haldane about the relationship between the entanglement spectrum and the spectrum of a physical edge state.Comment: 7 pages, 2 figures. A presentation of this work can be found in the following talk at KITP: http://online.itp.ucsb.edu/online/compqcm10/qi
    • …
    corecore